Exponential Decay of Sensitivity in Graph-Structured Nonlinear Programs

Exponential Decay in Nonlinear Networks1

MESSAGE-PASSING FOR GRAPH-STRUCTURED LINEAR PROGRAMS Message-passing for Graph-structured Linear Programs: Proximal Methods and Rounding Schemes

The problem of computing a maximum a posteriori (MAP) configuration is a central computational challenge associated with Markov random fields. There has been some focus on “tree-based” linear programming (LP) relaxations for the MAP problem. This paper develops a family of super-linearly convergent algorithms for solving these LPs, based on proximal minimization schemes using Bregman divergence...

On exponential domination and graph operations

An exponential dominating set of graph $G = (V,E )$ is a subset $Ssubseteq V(G)$ such that $sum_{uin S}(1/2)^{overline{d}{(u,v)-1}}geq 1$ for every vertex $v$ in $V(G)-S$, where $overline{d}(u,v)$ is the distance between vertices $u in S$ and $v  in V(G)-S$ in the graph $G -(S-{u})$. The exponential domination number, $gamma_{e}(G)$, is the smallest cardinality of an exponential dominating set....

dynamic coloring of graph

در این پایان نامه رنگ آمیزی دینامیکی یک گراف را بیان و مطالعه می کنیم. یک –kرنگ آمیزی سره ی رأسی گراف g را رنگ آمیزی دینامیکی می نامند اگر در همسایه های هر رأس v?v(g) با درجه ی حداقل 2، حداقل 2 رنگ متفاوت ظاهر شوند. کوچکترین عدد صحیح k، به طوری که g دارای –kرنگ آمیزی دینامیکی باشد را عدد رنگی دینامیکی g می نامند و آنرا با نماد ?_2 (g) نمایش می دهند. مونت گمری حدس زده است که تمام گراف های منتظم ...

Exponential Decay in Quantum Mechanics

First of all: disregard all of so called “preliminary physical expectations”, because all these expectations are just a pseudonym for prejudices elaborated by the older generation. These words belong to Dirac, not to me. The right way of creating new physics is different: one should begin with a beautiful mathematical idea. But it should be really beautiful! No special relations to physics is c...